A Simple Randomized Parallel Algorithm for Maximal f-Matching
نویسندگان
چکیده
We show how to extend the RNC-algorithm for maximal match-ings due to Israeli-Itai (presented in 5]) to compute maximal (with respect to set of edges inclusion) f-matchings. Our algorithm works in O(log 2 n) time on an arbitrary Crcw Pram with a linear number of processors. Also we slightly improve a constant coeecient in the analysis of the Israeli-Itai algorithm. Finally we present more eecient NC algorithms for maximal f-matchings for several non-trivial graph classes.
منابع مشابه
A Fast and Simple Randomized Parallel Algorithm for Maximal Matching
Let G(V, E) be an undirected graph. A set M ~ E is a matching if no two edges of M have a common vertex. The matching M is maximal if it is not properly contained in any other matching. Note that this does not necessarily imply that M has more edges than any other matching. A maximal matching can be found sequentially by the following greedy algorithm: Start with an empty matching and add any e...
متن کاملParallel Algorithms for Maximal Independent Set and Maximal Matching
We present a derandomization process which leads to efficient parallel algorithms for the maximal independent set and maximal matching problems. The derandomization of the general pairs PROFIT/COST problem depends on the derandomization of the bit pairs PROFIT/COST problem which follows Luby’s approach of using an O(n) sized sample space. This simplifies the approach presented in [16].
متن کاملOn Parallel Algorithms for Combinatorial Problems
Graphs are the most widely used of all mathematical structures. There is uncountable number of interesting computational problems de ned in terms of graphs. A graph can be seen as a collection of vertices (V ), and a collection of edges (E) joining all or some of the vertices. One is very often interested in nding subsets, either from the set V of vertices or from the set E of edges, which poss...
متن کاملOptimal Parallel Construction of Hamiltonian Cycles and Spanning Trees in Random Graphs (Preliminary Version)
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal matching can all be constructed in (log n) expected time using n= log n processors on the CRCW PRAM. This is a substantial improvement over the best previous algorithms, which required ((log log n)) time and n log n p...
متن کاملRemoving Randomness in Parallel Computation Without a Processor Penalty
We develop some general techniques for converting randomized parallel algorithms into deterministic parallel algorithms without a blowup in the number of processors. One of the requirements for the application of these techniques is that the analysis of the randomized algorithm uses only pairwise independence. Our main new result is a parallel algorithm for coloring the vertices of an undirecte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 57 شماره
صفحات -
تاریخ انتشار 1992